Partitions of Graphs into Coverings and Hypergraphs into Transversals
نویسنده
چکیده
A covering of a multigraph G is a subset of edges which meet ail vertices of G. Partitions of the edges of G into coverings Ci, C2,..., Ck are considered. In particular we examine how close the cardinalities of thèse coverings may be. A resuit concerning matchings is extended to the décomposition into coverings. Finally thèse considérations are generalized to the décompositions of the vertices of a hypergraph into transversals (a transversal is a set of vertices meeting ail edges of the hypergraph).
منابع مشابه
Partitioning of Loop-free Sperner Hypergraphs into Transversals
This article explores possibilities of partitioning the vertex set of a given simple loop-free Sperner hypergraph into a union of transversals. Studies are done on the possible number of transversals in such partitions, followed by forming a hypergraph (on the vertex set of the given hypergraph) that consists of transversals for hyperedges. AMS Subject Classification: 05C65
متن کاملCATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...
متن کاملTheorems of Borsuk-ulam Type for Flats and Common Transversals
In this paper some results on the topology of the space of k-flats in Rn are proved, similar to the Borsuk-Ulam theorem on coverings of sphere. Some corollaries on common transversals for families of compact sets in Rn, and on measure partitions by hyperplanes, are deduced.
متن کاملOn Multivariate Chromatic Polynomials of Hypergraphs and Hyperedge Elimination
In this paper we introduce multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomials is defined in terms of a deletion-contraction-extraction recurrence, previously investigated for graphs by Averbouch, Godlin, and Makowsky. The multivariate chromatic polynomial is an equivalent polynomial defined in terms of colorings, a...
متن کاملBounded size components--partitions and transversals
Answering a question of Alon, Ding, Oporowski and Vertigan [4], we show that there exists an absolute constant C such that every graph G with maximum degree 5 has a vertex partition into 2 parts, such that the subgraph induced by each part has no component of size greater than C. We obtain similar results for partitioning graphs of given maximum degree into k parts (k > 2) as well. A related th...
متن کامل